Estimating Phylogenies from Lacunose Distance Matrices: Additive is Superior to Ultrametric Estimation

نویسندگان

  • Pierre-Alexandre Landry
  • John A. W. Kirsch
چکیده

Lapointe and Kirsch (1995) have recently explored the possibility of reconstructing phylogenetic trees from lacunose distance matrices. They have shown that missing cells can be estimated using the ultrametric property of distances, and that reliable trees can be derived from such filled matrices. Here, we extend their work by introducing a novel way to estimate distances based on the four-point condition of additive matrices. A simulation study was designed to assess whether the additive procedure is superior to the ultrametric one in recovering distances randomly deleted from complete distance matrices. Our results clearly indicate that the topologies and branch lengths of the trees derived from matrices which were estimated additively are better recovered than those of trees derived from matrices estimated ultrametrically; the original distances are also better recovered with the additive procedure. Except in the case of small matrices with many missing cells for which both methods perform equally well, the additive is generally superior to the ultrametric method for estimating missing cells in distance matrices prior to phylogenetic reconstruction.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Title: A weighted least-squares approach for inferring phylogenies from incomplete distance matrices Authors:

Motivation: The problem of phylogenetic inference from data sets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares a...

متن کامل

Title : A weighted least - squares approach for inferring phylogenies from incomplete distance matrices

Motivation: The problem of phylogenetic inference from data sets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares a...

متن کامل

A weighted least-squares approach for inferring phylogenies from incomplete distance matrices

MOTIVATION The problem of phylogenetic inference from datasets including incomplete or uncertain entries is among the most relevant issues in systematic biology. In this paper, we propose a new method for reconstructing phylogenetic trees from partial distance matrices. The new method combines the usage of the four-point condition and the ultrametric inequality with a weighted least-squares app...

متن کامل

Deriving Ultrametric Tree Structures from Proximity Data Confounded by Differential Stimulus Familiarity

This paper presents a new procedure called TREEFAM for estimating ultrametric tree structures from proximity data confounded by differential stimulus familiarity. The objective of the proposed TREEFAM procedure is to quantitatively "filter out" the effects of stimulus unfamiliarity in the estimation of an ultrametric tree. A conditional, alternating maximum likelihood procedure is formulated to...

متن کامل

Neighbor Joining Algorithms for Inferring Phylogenies via LCA Distances

Reconstructing phylogenetic trees efficiently and accurately from distance estimates is an ongoing challenge in computational biology from both practical and theoretical considerations. We study algorithms which are based on a characterization of edge-weighted trees by distances to LCAs (Least Common Ancestors). This characterization enables a direct application of ultrametric reconstruction te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1998